Perimeter search in restricted memory
نویسندگان
چکیده
منابع مشابه
Forward Perimeter Search with Controlled Use of Memory
There are many hard shortest-path search problems that cannot be solved, because best-first search runs out of memory space and depth-first search runs out of time. We propose Forward Perimeter Search (FPS), a heuristic search with controlled use of memory. It builds a perimeter around the root node and tests each perimeter node for a shortest path to the goal. The perimeter is adaptively exten...
متن کاملCombining Perimeter Search and Pattern Database Abstractions
A pattern database abstraction (PDB) is a heuristic function in a form of a lookup table. A PDB stores the cost of optimal solutions for instances of abstract problems (subproblems). These costs are used as admissible heuristics for the original problem. Perimeter search (PS) is a form of bidirectional search. First, a breadth-first search is performed backwards from the goal state. Then, a for...
متن کاملBIDA: An Improved Perimeter Search Algorithm
In this paper we present a new bidirectional heuristic search algorithm. Our algorithm can be viewed as a perimeter search algorithm, and it uses a new technique for reducing the number of heuristic evaluations. We also prove some general results on the behavior of iterative deepening perimeter search algorithms, and we discuss some new “lazy evaluation” techniques for improving their performan...
متن کاملStronger Abstraction Heuristics Through Perimeter Search
Perimeter search is a bidirectional search algorithm consisting of two phases. In the first phase, a limited regression search computes the perimeter, a region which must necessarily be passed in every solution. In the second phase, a heuristic forward search finds an optimal plan from the initial state to the perimeter. The drawback of perimeter search is the need to compute heuristic estimate...
متن کاملThe role of memory and restricted context in repeated visual search.
Previous studies have shown that the efficiency of visual search does not improve when participants search through the same unchanging display for hundreds of trials (repeated search), even though the participants have a clear memory of the search display. In this article, we ask two important questions. First, why do participants not use memory to help search the repeated display? Second, can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1996
ISSN: 0898-1221
DOI: 10.1016/0898-1221(96)00154-x